Filtered Matrix-Vector Products via the Lanczos Algorithm with Applications to Dimension Reduction

نویسندگان

  • Jie Chen
  • Yousef Saad
چکیده

This paper discusses an efficient technique for computing filtered matrix-vector (mat-vec) products by exploiting the Lanczos algorithm. The goal of the proposed method, which is the same as that of the truncated singular value decomposition (SVD), is to preserve the quality of the resulting mat-vec product in major singular directions of the matrix. Unlike the SVD-based techniques, the proposed algorithms achieve this goal by using a small number of Lanczos vectors, without explicitly computing the major singular values/vectors of the matrix. The main advantage of the proposed method is its low cost compared with SVDbased techniques. This advantage comes without sacrificing accuracy. The effectiveness of the method is demonstrated on a few sample examples requiring dimension reduction, including information retrieval and face recognition.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Gpu Implementation of the Filtered Lanczos

This paper describes a graphics processing unit (GPU) implementation of the Filtered Lanczos Procedure for the solution of large, sparse, symmetric eigenvalue problems. The Filtered Lanczos Procedure uses a carefully chosen polynomial spectral transformation to accelerate the convergence of the Lanczos method when computing eigenvalues within a desired interval. This method has proven particula...

متن کامل

Computation of Large Invariant Subspaces Using Polynomial Filtered Lanczos Iterations with Applications in Density Functional Theory

The most expensive part of all electronic structure calculations based on density functional theory lies in the computation of an invariant subspace associated with some of the smallest eigenvalues of a discretized Hamiltonian operator. The dimension of this subspace typically depends on the total number of valence electrons in the system, and can easily reach hundreds or even thousands when la...

متن کامل

Polynomial filtered Lanczos iterations with applications in Density Functional Theory

The most expensive part of all Electronic Structure Calculations based on Density Functional Theory, lies in the computation of an invariant subspace associated with some of the smallest eigenvalues of a discretized Hamiltonian operator. The dimension of this subspace typically depends on the total number of valence electrons in the system, and can easily reach hundreds or even thousands when l...

متن کامل

Extended Lanczos Bidiagonalization for Dimension Reduction in Information Retrieval

We describe an extended bidiagonalization scheme designed to compute low-rank approximations of very large data matrices. Its goal is identical to that of the truncated singular value decomposition, but it is significantly cheaper. It consists in an extension of the standard Lanczos bidiagonalization that improves its approximation capabilities, while keeping the computational cost reasonable. ...

متن کامل

Eigenvalue Computations Based on IDR

The induced dimension reduction (IDR) method, which has been introduced as a transpose-free Krylov space method for solving nonsymmetric linear systems, can also be used to determine approximate eigenvalues of a matrix or operator. The IDR residual polynomials are the products of a residual polynomial constructed by successively appending linear smoothing factors and the residual polynomials of...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007